The error structure of the Douglas-Rachford splitting method for stiff linear problems
نویسندگان
چکیده
The Lie splitting algorithm is frequently used when splitting stiff ODEs or, more generally, dissipative evolution equations. It is unconditionally stable and is considered to be a robust choice of method in most settings. However, it possesses a rather unfavorable local error structure. This gives rise to order reductions if the evolution equation does not satisfy extra compatibility assumptions. To remedy the situation one can add correction-terms to the splitting scheme which, e.g., yields the first-order Douglas–Rachford (DR) scheme. In this paper we derive a rigorous error analysis in the setting of linear dissipative operators and inhomogeneous evolution equations. We also illustrate the order reduction of the Lie splitting, as well as the far superior performance of the DR splitting.
منابع مشابه
Metric Selection in Douglas-Rachford Splitting and ADMM
Recently, several convergence rate results for Douglas-Rachford splitting and the alternating direction method of multipliers (ADMM) have been presented in the literature. In this paper, we show linear convergence of Douglas-Rachford splitting and ADMM under certain assumptions. We also show that the provided bounds on the linear convergence rates generalize and/or improve on similar bounds in ...
متن کاملDouglas-Rachford Splitting for Cardinality Constrained Quadratic Programming
In this report, we study the class of Cardinality Constrained Quadratic Programs (CCQP), problems with (not necessarily convex) quadratic objective and cardinality constraints. Many practical problems of importance can be formulated as CCQPs. Examples include sparse principal component analysis [1], [2], cardinality constrained mean-variance portfolio selection problem [3]–[5], subset selection...
متن کاملPeaceman-Rachford splitting for a class of nonconvex optimization problems
We study the applicability of the Peaceman-Rachford (PR) splitting method for solving nonconvex optimization problems. When applied to minimizing the sum of a strongly convex Lipschitz differentiable function and a proper closed function, we show that if the strongly convex function has a large enough strong convexity modulus and the step-size parameter is chosen below a threshold that is compu...
متن کاملA New Use of Douglas-Rachford Splitting and ADMM for Identifying Infeasible, Unbounded, and Pathological Conic Programs
In this paper, we present a method for identifying infeasible, unbounded, and pathological conic programs based on Douglas-Rachford splitting, or equivalently ADMM. When an optimization program is infeasible, unbounded, or pathological, the iterates of Douglas-Rachford splitting diverge. Somewhat surprisingly, such divergent iterates still provide useful information, which our method uses for i...
متن کاملPreconditioned Douglas-Rachford Splitting Methods for Convex-concave Saddle-point Problems
We propose a preconditioned version of the Douglas-Rachford splitting method for solving convexconcave saddle-point problems associated with Fenchel-Rockafellar duality. It allows to use approximate solvers for the linear subproblem arising in this context. We prove weak convergence in Hilbert space under minimal assumptions. In particular, various efficient preconditioners are introduced in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Computational Applied Mathematics
دوره 303 شماره
صفحات -
تاریخ انتشار 2016